9-Point and 7-Point Configurations in 3-Space

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measuring 3D point configurations in pictorial space

We propose a novel method to probe the depth structure of the pictorial space evoked by paintings. The method involves an exocentric pointing paradigm that allows one to find the slope of the geodesic connection between any pair of points in pictorial space. Since the locations of the points in the picture plane are known, this immediately yields the depth difference between the points. A set o...

متن کامل

On Matching Point Configurations

We present an algorithm that verifies if two unlabeled configurations of N points in Rd are or are not an orthogonal transformation of one another, and if applicable, explicitly compute that transformation. We also give a formula for the orthogonal transformation in the case of noisy measurements. AMS subject classification: 65F15, 65F35, 65G99.

متن کامل

1 Finite Point Configurations

The study of combinatorial properties of finite point configurations is a vast area of research in geometry, whose origins go back at least to the ancient Greeks. Since it includes virtually all problems starting with “consider a set of n points in space,” space limitations impose the necessity of making choices. As a result, we will restrict our attention to Euclidean spaces and will discuss p...

متن کامل

Point Configurations and Coxeter Operads

The minimal blow-ups of simplicial Coxeter complexes are natural generalizations of the real moduli space of Riemann spheres. They inherit a tiling by the graph-associahedra convex polytopes. We obtain explicit configuration space models for the classical infinite families of finite and affine Weyl groups using particles on lines and circles. A Fulton-MacPherson compactification of these spaces...

متن کامل

Subquadratic Encodings for Point Configurations

For most algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial configuration of the points: the orientation of each triple of points in the set (clockwise, counterclockwise, or collinear). This information is called the order type of the point set. In the dual, realizable order types and abstract order types are combinatoria...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 1963

ISSN: 0024-6115

DOI: 10.1112/plms/s3-13.1.384-s